A Probabilistic Proof of the Girth-Chromatic Number Theorem
نویسنده
چکیده
This works presents a formalization of the Girth-Chromatic number theorem in graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. The proof uses the theory of Random Graphs to prove the existence with probabilistic arguments and is based on [1].
منابع مشابه
Proof Pearl: A Probabilistic Proof for the Girth-Chromatic Number Theorem
The Girth-Chromatic number theorem is a theorem from graph theory, stating that graphs with arbitrarily large girth and chromatic number exist. We formalize a probabilistic proof of this theorem in the Isabelle/HOL theorem prover, closely following a standard textbook proof and use this to explore the use of the probabilistic method in a theorem prover.
متن کاملA New Proof of the Girth - Chromatic Number Theorem
We give a new proof of the classical Erdös theorem on the existence of graphs with arbitrarily high chromatic number and girth. Rather than considering random graphs where the edges are chosen with some carefully adjusted probability, we use a simple counting argument on a set of graphs with bounded vertex degree.
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملThe Probabilistic Method in Combinatorics
2 The Linearity of Expectation and small tweakings 11 2.1 Revisiting the Ramsey Number R(n, n) . . . . . . . . . . . . . . . . . . . 11 2.2 List Chromatic Number and minimum degree . . . . . . . . . . . . . . . 11 2.3 The Daykin-Erdős conjecture . . . . . . . . . . . . . . . . . . . . . . . . 13 2.4 An Example from Combinatorial Geometry . . . . . . . . . . . . . . . . . 14 2.5 Graphs with High...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012